A Linear Logic Programming Language for Concurrent Programming over Graph Structures
نویسندگان
چکیده
منابع مشابه
A Linear Logic Programming Language for Concurrent Programming over Graph Structures
We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally c...
متن کاملDistributed Concurrent Linear Logic Programming
We propose a framework of distributed concurrent linear logic programming, which can elegantly capture the essential features of distributed computation: locationdependence/independence of names and movement of computation. We rst de ne the syntax and semantics of a modal linear logic that is suitable for expressing distributed computation, and then show that there is a close relationship betwe...
متن کاملACL - A Concurrent Linear Logic Programming Paradigm
We propose a novel concurrent programming framework called ACL. ACL is a variant of linear logic programming, where computation is described in terms of bottom-up proof search of some formula in linear logic. The whole linear sequent calculus is too non-deterministic to be interpreted as an operational semantics for a realistic programming language. We restrict formulas and accordingly rene inf...
متن کاملA Logic for Concurrent Programming
The UNITY-logic, a fragment of linear temporal logic, was introduced in 5]. In this paper, we describe several recent modiications to this logic. In particular, the operator co replaces unless, for expressing safety properties and, transient predicates form the basis for the progress properties. Our experience suggests that these modiications simplify both the theory and practice of this logic....
متن کاملConcurrent Logic Programming as Uniform Linear Proofs
We describe a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic languages) provides a simpler operational model that can lead to a more practical language core. The fragment is proved to be an abstract logic programming language, that is any sequent can be derived by uniform proo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2014
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068414000167